Introduction to Evolutionary Multiobjective Optimization
نویسنده
چکیده
In its current state, evolutionary multiobjective optimization (EMO) is an established field of research and application with more than 150 PhD theses, more than ten dedicated texts and edited books, commercial softwares and numerous freely downloadable codes, a biannual conference series running successfully since 2001, special sessions and workshops held at all major evolutionary computing conferences, and full-time researchers from universities and industries from all around the globe. In this chapter, we provide a brief introduction to EMO principles, illustrate some EMO algorithms with simulated results, and outline the current research and application potential of EMO. For solving multiobjective optimization problems, EMO procedures attempt to find a set of well-distributed Pareto-optimal points, so that an idea of the extent and shape of the Pareto-optimal front can be obtained. Although this task was the early motivation of EMO research, EMO principles are now being found to be useful in various other problem solving tasks, enabling one to treat problems naturally as they are. One of the major current research thrusts is to combine EMO procedures with other multiple criterion decision making (MCDM) () tools so as to develop hybrid and interactive multiobjective optimization algorithms for finding a set of trade-off optimal solutions and then choose a preferred solution for implementation. This chapter provides the background of EMO principles and their potential to launch such collaborative studies with MCDM researchers in the
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملMultiobjective evolutionary algorithms: A survey of the state of the art
This paper reviews some state-of-the-art hybrid multiobjective evolutionary algorithms (MOEAs) dealing with multiobjective optimization problem (MOP). The mathematical formulation of a MOP and some basic definition for tackling MOPs, including Pareto optimality, Pareto optimal set (PS), Pareto front (PF) are provided in Section 1. Section 2 presents a brief introduction to hybrid MOEAs.
متن کاملComprehensive Survey of the Hybrid Evolutionary Algorithms
Multiobjective evolutionary algorithm based on decomposition (MOEA/D) and an improved non-dominating sorting multiobjective genetic algorithm (NSGA-II) are two well known multiobjective evolutionary algorithms (MOEAs) in the field of evolutionary computation. This paper mainly reviews their hybrid versions and some other algorithms which are developed for solving multiobjective optimization pro...
متن کاملCurrent and Future Research Trends in Evolutionary Multiobjective Optimization
In this chapter we present a brief analysis of the current research performed on evolutionary multiobjective optimization. After analyzing first and second generation multiobjective evolutionary algorithms, we address two important issues: the role of elitism in evolutionary multiobjective optimization and the way in which concepts from multiobjective optimization can be applied to constraint-h...
متن کاملCrowding Factor In Evolutionary Multi-Agent System For Multiobjective Optimization
In this paper an implementation of an Evolutionary MultiAgent System (EMAS) for multiobjective optimization in the Pareto sense is presented. Some basic ideas of Pareto optimization is shown. Also the idea of putting EMAS into work on multiobjective optimization is described. In particular the parameter called the crowding factor is presented and discussed. It is explained, what is the crowding...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008